Predicate Logic with Sequence Variables and Sequence Function Symbols
نویسندگان
چکیده
We extend first-order logic with sequence variables and sequence functions. We describe syntax, semantics and inference system for the extension, define an inductive theory with sequence variables and formulate induction rules. The calculus forms a basis for the top-down systematic theory exploration paradigm.
منابع مشابه
Unification Procedure for Terms with Sequence Variables and Sequence Functions
We study term equations with sequence variables and sequence function symbols. A sequence variable can be instantiated by any finite sequence of terms, including the empty sequence. A sequence function abbreviates a finite sequence of functions all having the same argument lists. An instance of such a function is IntegerDivision(x,y) that abbreviates the sequence Quotient(x, y),Remainder(x, y)....
متن کاملClique and Vertex Cover Are Solvable in Polynomial Time If the Input Structure Is Ordered and Contains a Successor Predicate
In this manuscript, assuming that Grädel's 1991 results are correct (which implies that bounds on the solution values for optimization problems can be expressed in existential second order logic where the first order part is universal Horn), I will show that Clique and Vertex Cover can be solved in polynomial time if the input structure is ordered and contains a successor predicate. 1 Backgroun...
متن کاملSecond-Order Functions and Theorems in ACL2
SOFT (‘Second-Order Functions and Theorems’) is a tool to mimic second-order functions and theorems in the first-order logic of ACL2. Second-order functions are mimicked by first-order functions that reference explicitly designated uninterpreted functions that mimic function variables. First-order theorems over these second-order functions mimic second-order theorems universally quantified over...
متن کاملIndex Sets for Finite Normal Predicate Logic Programs with Function Symbols
We study the recognition problem in the metaprogramming of finite normal predicate logic programs. That is, let L be a computable first order predicate language with infinitely many constant symbols and infinitely many n-ary predicate symbols and n-ary function symbols for all n ≥ 1. Then we can effectively list all the finite normal predicate logic programs Q0, Q1, . . . over L. Given some pro...
متن کاملCylindric Algebras of First - Order Languages
We show when two countable first-order languages have isomorphic cylindric algebras. Introduction. The cylindric algebra of a language is the co-dimensional cylindric algebra of formulas of the language modulo logical equivalence. We classify first-order languages according to the isomorphism types of their cylindric algebras. For two languages involving only predicate symbols, their cylindric ...
متن کامل